An adaptation of Constraint Handling Rules for Interactive and Intelligent Installations
نویسنده
چکیده
Constraint Handling Rules, CHR, have proved to be effective for a large range of reasoning tasks, which makes it interesting in different sorts of interactive installations. Typically, such an installation involves a large number of cooperating software components that need to refer to a common knowledge. Using CHR’s constraint stores as a knowledge representation may be appealing from a theoretical point of view, but suffers from the inherent limitation of CHR, that a constraint store disappears immediately after a query has been evaluated. An extension to CHR is proposed, which allows different processes to reason over and maintain a common knowledge base represented as text files containing constraints. Constraints are automatically read from and written to the files before and after a query has been executed, which means that the intended style of programming deviates only very little from traditional CHR programming.
منابع مشابه
Adaptive CHR Meets CHRv: An Extended Refined Operational Semantics for CHRv Based on Justifications
Adaptive constraint processing with Constraint Handling Rules (CHR) allows the application of intelligent search strategies to solve Constraint Satisfaction Problems (CSP), but these search algorithms have to be implemented in the host language of adaptive CHR, which is currently Java. On the other hand, CHR enables to explicitly formulate search in CHR, using disjunctive bodies to model choice...
متن کاملA Constraint Handling Rules Implementation for Known-Arc-Consistency in Interactive Constraint Satisfaction Problems
In classical CLP(FD) systems, domains of variables are completely known at the beginning of the constraint propagation process. However, in systems interacting with an external environment, acquiring the whole domains of variables before the beginning of constraint propagation may cause waste of computation time, or even obsolescence of the acquired data at the time of use. For such cases, the ...
متن کاملSEQUENTIAL PENALTY HANDLING TECHNIQUES FOR SIZING DESIGN OF PIN-JOINTED STRUCTURES BY OBSERVER-TEACHER-LEARNER-BASED OPTIMIZATION
Despite comprehensive literature works on developing fitness-based optimization algorithms, their performance is yet challenged by constraint handling in various engineering tasks. The present study, concerns the widely-used external penalty technique for sizing design of pin-jointed structures. Observer-teacher-learner-based optimization is employed here since previously addressed by a number ...
متن کاملProjection in Adaptive Constraint
Constraint solving in dynamic environments requires an immediate adaptation of the solutions if the constraint problems are changing. After any change the solutions have to be immediately adapted. Therefore, a wide range of incremental constraint solving algorithms for dynamic constraint satisfaction problems (DCSPs) are available. Some of these algorithms are based on Fr uhwirth's Constraint H...
متن کاملIntelligent search strategies based on adaptive Constraint Handling Rules
The most advanced implementation of adaptive constraint processing with Constraint Handling Rules (CHR) allows the application of intelligent search strategies to solve Constraint Satisfaction Problems (CSP). This presentation compares an improved version of conflict-directed backjumping and two variants of dynamic backtracking with respect to chronological backtracking on some of the AIM insta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012